On the optimality of a simple strategy for searching graphs
نویسنده
چکیده
Consider a search game with an immobile hider in a graph. A Chinese postman tour is a closed trajectory which visits all the points of the graph and has minimal length. We show that encircling the Chinese postman tour in a random direction is an optimal search strategy if and only if the graph is weakly Eulerian (i.e it consists of several Eulerian curves connected in a tree-like structure).
منابع مشابه
Optimal Simple Step-Stress Plan for Type-I Censored Data from Geometric Distribution
Abstract. A simple step-stress accelerated life testing plan is considered when the failure times in each level of stress are geometrically distributed under Type-I censoring. The problem of choosing the optimal plan is investigated using the asymptotic variance-optimality as well as determinant-optimality and probability-optimality criteria. To illustrate the results of the paper, an example i...
متن کاملIdentifying Ferdowsi University of Mashhad Graduated Students' Search Strategies during their Information-searching through the Web
Purpose: the aim was to identify users' search strategies and the rate of using search strategies on the web. Method: It is a practical survey. The statistical population included all the postgraduate students in the first semester at Ferdowsi University of Mashhad. 95 students were selected by stratified random sampling method. To gather the data, log files were used. Findings: 12 search strat...
متن کاملOptimal Design of Geometrically Nonlinear Structures Under a Stability Constraint
This paper suggests an optimization-based methodology for the design of minimum weight structures with kinematic nonlinear behavior. Attention is focused on three-dimensional reticulated structures idealized with beam elements under proportional static loadings. The algorithm used for optimization is based on a classical optimality criterion approach using an active-set strategy for extreme lim...
متن کاملSynthesizing Human Motion from Intuitive Constraints
Many compelling applications would become feasible if novice users had the ability to synthesize high quality human motion based only on a simple sketch and a few easily specified constraints. Motion graphs and their variations have proven to be a powerful tool for synthesizing human motion when only a rough sketch is given. Motion graphs are simple to implement, and the synthesis can be fully ...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 2001